Improved Parallel Polynomial Division and Its Extensions
نویسندگان
چکیده
We compute the rst N coeecients of the reciprocal r(x) of a given polynomial p(x), (r(x)p(x) = 1 mod x N , p(0) 6 = 0), by using, under the PRAM arithmetic models , O(h log N) time-steps and O((N=h)(1 + 2 ?h log (h) N)) processors, for any h, h = 1; 2; : : : ; log N, provided that O(log m) steps and m processors suuce to perform DFT on m points and that log (0)
منابع مشابه
Extensions of strongly alpha-reversible rings
We introduce the notion ofstrongly $alpha$-reversible rings which is a strong version of$alpha$-reversible rings, and investigate its properties. We firstgive an example to show that strongly reversible rings need not bestrongly $alpha$-reversible. We next argue about the strong$alpha$-reversibility of some kinds of extensions. A number ofproperties of this version are established. It is shown ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملPolynomial division and its computational complexity
(i) First we show that all the known algorithms for polynomial division can be represented as algorithms for triangular Toeplitz matrix inversion. In spite of the apparent difference of the algorithms of these two classes, their strong equivalence is demonstrated. (ii) Then we accelerate parallel division of two polynomials with integer coefficients of degrees at most m by a factor of log m com...
متن کامل